Greg Detre
@14:30 Monday, September 30, 2002
use
database look-up to prune the search space by providing shortcuts from certain
states to certain other states � trading off space for time
you can define various rules for moving one piece to another position,
but it doesn�t necessarily assume that it will leave the other spaces unchanged
you�re only using it to prune the search space for your heuristics(???)
heavy-tailed distribution
infinite variance and infinite mean�???
log-log scale � straight line
take advantage of, with randomisation (Gomes & Selman 1997)
A* is optimally efficient???
given the cost of hardware at a given moment, can you decide on an absolute minimal sweet spot within the time-space monetary cost trade-off???
heavy-tailed distribution???
constraint satisfaction vs NN???